Optimal Solutions for Frequency Assignment Problems via Tree Decomposition
نویسندگان
چکیده
In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. With the use of several dominance and bounding techniques it is possible to solve small and medium-sized real-life instances of the frequency assignment problem to optimality. Moreover, with an iterative version of the algorithm we obtain good lower bounds for large-sized instances within reasonable time and memory limits.
منابع مشابه
Solving Frequency Assignment Problems via Tree-Decomposition
In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. We show that with the use of several dominance and bounding techniques it is possible to solve small and medium...
متن کاملTreewidth: Computational Experiments
ManyNP-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to find (almost) optimal solutions or lower bounds for many optimization problems. To apply a tree decomposition ...
متن کاملSolving railway line planning problems using a decomposition algorithm
The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....
متن کاملA heuristic decomposition methodology for channel assignment problems in mobile communication systems
The present paper puts forward an efficient ‘First decompose, then Solve’ solution strategy for Channel Assignment Problems (CAP) in Cellular Communications System. The underlying objective of the decomposition technique presented in this paper is that the Interference Graph (IG) developed for intractable CAP be broken down into sub-graphs (Channel Assignment Sub-Problems, CASP’s) of lower comp...
متن کاملRapid Protein Side-Chain Packing via Tree Decomposition
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficiently. Theoretically, the computational complexity of this algorithm isO((N +M)n rot ) whereN is the number of residues in the protein,M the number of interacting residue pairs, nrot the average number of rotamers for e...
متن کامل